| 1. | A heuristic algorithm for flow shop problem in batch processing
成组排序问题的调度算法设计及其界的估计 |
| 2. | Interval perturbation robustness of optimal schedules for a class of flow shop problems
调度问题最优调度区间摄动鲁棒性 |
| 3. | Then , found its application in flow shop scheduling problems with two objects
并应用该算法解决了双目标的流水车间调度问题。 |
| 4. | Parallel flow shop scheduling problem using probability learning based evolutionary algorithm
并行流程车间调度问题及其概率学习进化算法 |
| 5. | An improved evolutionary algorithm based on heuristic rules for flow shop scheduling
基于启发式规则的新型进化算法在流水车间调度中的应用 |
| 6. | According to ants ' routing behavior model and its resemblance to hybrid flow shop scheduling , an ant - like scheduling algorithm for hybrid flow shop is put forward
摘要根据蚂蚁路迳寻优行?模型及其与混流车间调度的相似性，提出混流车间的蚂蚁调度算法。 |
| 7. | 3 . aiming at the limitation of simulated anneal genetic algorithm on a high computation while applied to flow shop scheduling problems , the paper presented selected simulated anneal genetic algorithm
三、针对模拟退火遗传算法解决流水车间调度问题存在收敛速度慢的局限性，提出了选择性退火的遗传算法。 |
| 8. | The algorithm is further used to simulate the flow shop scheduling in the parallel movement . the results display that the " premature restraint " is restrained , and the solution quality is improved
并用该算法对平行顺序移动方式下flowshop调度问题进行模拟计算，结果表明，遗传算法的早收敛现象得到遏制，解的质量有所提高。 |
| 9. | By the computer simulation of different scales of real examples , the results show that the new algorithm embraces all - round searching advantages toward flow shop scheduling problem , and a chieves overall optimal solution
通过对不同规模的实例进行计算机模拟，结果表明算法对求解flowshop排序问题具有全局搜索优势，获得了群体优化解。 |
| 10. | By this algorithm , the optimal solution can been obtained in transportation problem n assignment problem , traveling salesman problenu flow shop sequencing problems hamilton problem . in addition , numerical examples have been given to demonstrate the actual applicant procedure
并且通过对排序问题、货郎担货问题、指派问题、 hamilton问题等线形规划问题典型算例的求解，表明新的分配原则在一定程度上简化了原有的分配过程，具有更强的通用性。 |
